New solutions of LR fuzzy linear systems using ranking functions and ABS algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

NEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS

We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...

متن کامل

exact and approximate solutions of fuzzy lr linear systems: new algorithms using a least squares model and the abs approach

we present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with lr fuzzy variables. as solutions, notions of exact and approximate solutions are considered. we transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. if the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

Solutions of Fuzzy Linear Systems using Ranking function

In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...

متن کامل

new models and algorithms for solutions of single-signed fully fuzzy lr linear systems

we present a model and propose an approach to compute an approximate solution of fully fuzzy linear system $(ffls)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. first, in discussing an $ffls$ with a nonnegative coefficient matrix, we consider an equivalent $ffls$ by using an appropriate permutation to simplify fuzzy multiplications. t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Modelling

سال: 2010

ISSN: 0307-904X

DOI: 10.1016/j.apm.2010.02.026